Time-Varying Realization for Arbritary Functions
نویسندگان
چکیده
منابع مشابه
Time-Varying Eigensystem Realization Algorithm
An identification algorithm called the time-varying eigensystem realization algorithm is proposed to realize discrete-time-varying plant models from input and output experimental data. It is shown that this singular value decomposition based method is a generalization of the eigensystem realization algorithm developed to realize time invariant models from pulse response sequences. Using the res...
متن کاملTIME-VARYING FUZZY SETS BASED ON A GAUSSIAN MEMBERSHIP FUNCTIONS FOR DEVELOPING FUZZY CONTROLLER
The paper presents a novel type of fuzzy sets, called time-Varying Fuzzy Sets (VFS). These fuzzy sets are based on the Gaussian membership functions, they are depended on the error and they are characterized by the displacement of the kernels to both right and left side of the universe of discourse, the two extremes kernels of the universe are fixed for all time. In this work we focus only on t...
متن کاملNew realization method for linear periodic time-varying filters
For channel modelisation, modulation and analogue scrambling, the modern telecommunications use often linear periodic time-varying filters. The authors recall the definition of these filters. In particular, it is shown that a stationary process subjected to a linear periodic filter becomes cyclostationary. In this paper, we show that any linear periodic filter can be realized by means of period...
متن کاملLearning Time-Varying Coverage Functions
Coverage functions are an important class of discrete functions that capture the law of diminishing returns arising naturally from applications in social network analysis, machine learning, and algorithmic game theory. In this paper, we propose a new problem of learning time-varying coverage functions, and develop a novel parametrization of these functions using random features. Based on the co...
متن کاملTime-varying computational networks: realization, lossless embedding and structural factorization
Many computational schemes in linear algebra can be studied from the point of view of (discrete) time-varying linear systems theory. For example, the operation ‘multiplication of a vector by an upper triangular matrix’ can be represented by a computational scheme (or model) that acts on the entries of the vector sequentially. The number of intermediate quantities (‘states’) that are needed in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.600